A Survey on Discrete Laplacians for General Polygonal Meshes
نویسندگان
چکیده
The Laplace Beltrami operator is one of the essential tools in geometric processing. It allows us to solve numerous partial differential equations on discrete surface meshes, which a fundamental building block many computer graphics applications. Discrete Laplacians are typically limited standard elements like triangles or quadrilaterals, severely constrains tessellation mesh. But recent years, several approaches were able generalize and its closely related gradient divergence operators more general meshes. This artists engineers work with wider range sometimes required beneficial their field. paper discusses different constructions these three ubiquitous arbitrary polygons analyzes individual advantages properties common
منابع مشابه
Computing discrete shape operators on general meshes
Discrete curvature and shape operators, which capture complete information about directional curvatures at a point, are essential in a variety of applications: simulation of deformable two-dimensional objects, variational modeling and geometric data processing. In many of these applications, objects are represented by meshes. Currently, a spectrum of approaches for formulating curvature operato...
متن کاملProgressive Polygonal Meshes
In this work we build a progressive polygonal mesh based on face clustering. The basic simplification operations are the edge-removal and the edge-join operations. There is no need to tessellate non-triangular models as the proposed representation is fully polygonal. We investigate three different error measures to build the progressive representation based on a priority queue based face cluste...
متن کاملVirtual Element Method for General Second Order Elliptic Problems on Polygonal Meshes
We consider the discretization of a boundary value problem for a general linear secondorder elliptic operator with smooth coefficients using the Virtual Element approach. As in 34 the problem is supposed to have a unique solution, but the associated bilinear form is not supposed to be coercive. Contrary to what was previously done for Virtual Element Methods (as for instance in 5), we use here,...
متن کاملOn the Rigidity of Polygonal Meshes
A polygonal mesh is a connected subset of a polyhedral surface. We address the problem whether the intrinsic metric of a mesh, i.e., its development, can determine the exterior metric. If this is the case then the mesh is rigid. Among the non-rigid cases even flexible versions are possible. We concentrate on quadrangular meshes and in particular on a mesh with a flat pose in which the quadrangl...
متن کاملFast Neighborhood Search on Polygonal Meshes
We introduce a spatial index to support the fast retrieval of large neighborhoods of points on a polygonal mesh. Our spatial index can be computed efficiently off-line, introducing a negligible overhead over a standard indexed data structure. In retrieving neighborhoods of points on-line, we achieve a speed-up of about one order of magnitude with respect to standard topological traversal, while...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2023
ISSN: ['1467-8659', '0167-7055']
DOI: https://doi.org/10.1111/cgf.14777